Cryptographic Algorithm Based on Hybrid One-Dimensional Cellular Automata
نویسندگان
چکیده
The theory and application of cellular automata (CA) for a stream cipher-based encryption principle are presented in this study. Certain fundamental transformations developed based on CA regarding decentralized computation modeling different system’s behavior. changes governing state transitions rely simple evolution rules, which can easily be translated into functions using logic operators. A class linear hybrid (LHCA) rules 90 150 is used to implement these functions. Symmetric key systems the foundation suggested algorithm. algorithm use proprieties provided by LHCA order convert plain text cipher vice versa, each case starting from same initial system performing number steps operation. Cellular automata’s parallel information processing property, addition their regular dynamical structure, makes hardware implementation such schemes best suited VLSI implementation. Testing proposed was performed developing both software solutions. Hardware cryptosystem VHDL description language FPGA device (XILINX Spartan3E XC3S500E). Design simulations have been carried out C# programming language.
منابع مشابه
Synthesis of one-dimensional linear hybrid cellular automata
Plus BROWSE SEARCH IEEE XPLORE GUIDE View TOC | Previous Article | Next Article Synthesis of one-dimensional linear hybrid cellular autom Cattell, K. Muzio, J.C. Dept. of Comput. Sci., Victoria Univ., BC; This paper appears in: Computer-Aided Design of Integrated Circuits and Systems, on Publication Date: Mar 1996 Volume: 15, Issue: 3 On page(s): 325-335 ISSN: 0278-0070 References Cited: 20 COD...
متن کاملHybrid one-dimensional reversible cellular automata are regular
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences. For example, it allows checking whether a given CA is reversible and the random generation of a reversible CA from the uniform distribution, both using time polynomial in the size of the CA. Unfortunately, the consta...
متن کاملOn One-Dimensional Quantum Cellular Automata
Since Richard Feynman introduced the notion of quantum computation in 1982, various models of \quantum computers" have been proposed. These models include quantum Turing machines and quantum circuits. In this paper we deene another quantum computational model, one-dimensional quantum cellular automata, and demonstrate that any quantum Turing machine can be eeciently simulated by a one-dimension...
متن کاملA Maze Routing Algorithm Based on Two Dimensional Cellular Automata
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that the path does not pass from the obstacles. Algorithm has two phases, exploration and retrace. In exploration phase a wave is expanded from source cell and it puts token on cells which it passes via them while expanding....
متن کاملCellular Automata Based Cryptographic Hash Function
* This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education, Science and Technology(2011-0014977). Abstract Recently, in many applications where speed is important and very large amounts of data have to be authenticated, hardware implementation is demanded as a natural solution. A cellular automata (C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11061481